Explanation-based Learning and Reinforcement Learning: a Uniied View

In speedup learning problems where full descriptions of operators are known both explanation based learning EBL and reinforcement learning RL methods can be applied This paper shows that both methods involve fundamentally the same process of propagating information backward from the goal toward the starting state Most RL methods perform this propagation on a state by state basis while EBL methods compute the weakest preconditions of operators and hence perform this propagation on a region by region basis Barto Bradtke and Singh have observed that many algorithms for reinforcement learning can be viewed as asynchronous dynamic programming Based on this observation this paper shows how to develop dynamic programming versions of EBL which we call region based dynamic programming or Explanation Based Reinforcement Learning EBRL The paper compares batch and online versions of EBRL to batch and online versions of point based dynamic programming and to standard EBL The results show that region based dynamic programming combines the strengths of EBL fast learning and the ability to scale to large state spaces with the strengths of reinforcement learning algorithms learning of optimal policies Results are shown in chess endgames and in synthetic maze tasks